Decidability of Geometricity of Regular Languages
نویسندگان
چکیده
Geometrical languages generalize languages introduced to model temporal validation of real-time softwares. We prove that it is decidable whether a regular language is geometrical. This result was previously known for binary languages.
منابع مشابه
Regular realizability problems and models of a generalized nondeterminism
Models of a generalized nondeterminism are defined by limitations on nondeterministic behavior of a computing device. A regular realizability problem is a problem of verifying existence of a special sort word in a regular language. These notions are closely connected. In this paper we consider regular realizability problems for languages consisting of all prefixes of an infinite word. These pro...
متن کاملTOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES
We present a topological characterization for fuzzy regular languages: we show that there is a bijective correspondence between fuzzy regular languages and the set of all clopen fuzzy subsets with finite image in the induced fuzzy topological space of Stone space (Profinite space), and then we give a representation of closed fuzzy subsets in the induced fuzzy topological space via fuzzy regular...
متن کاملPairs of Languages Closed under Shuffle Projection
Shuffle projection is motivated by the verification of safety properties of special parameterized systems. Basic definitions and properties, especially related to alphabetic homomorphisms, are presented. The relation between iterated shuffle products and shuffle projections is shown. A special class of multi-counter automata is introduced, to formulate shuffle projection in terms of computation...
متن کاملDecidability of Context Logic
We consider the problem of decidability for Context Logic for sequences, ranked trees and unranked trees. We show how to translate quantifier-free formulae into finite automata that accept just the sequences or trees which satisfy the formulae. Satisfiability is thereby reduced to the language emptiness problem for finite automata, which is simply a question of reachability. This reduction show...
متن کاملDeterministic Fuzzy Automaton on Subclasses of Fuzzy Regular ω-Languages
In formal language theory, we are mainly interested in the natural language computational aspects of ω-languages. Therefore in this respect it is convenient to consider fuzzy ω-languages. In this paper, we introduce two subclasses of fuzzy regular ω-languages called fuzzy n-local ω-languages and Buchi fuzzy n-local ω-languages, and give some closure properties for those subclasses. We define a ...
متن کامل